Hamilton cycles in almost distance-hereditary graphs
نویسندگان
چکیده
منابع مشابه
Hamilton Cycles in Cubic Graphs
A graph is cubic if each of its vertex is of degree 3 and it is hamiltonian if it contains a cycle passing through all its vertices. It is known that if a cubic graph is hamiltonian, then it has at least three Hamilton cycles. This paper is about those works done concerning the number of Hamilton cycles in cubic graphs and related problems.
متن کاملHAMILTON `-CYCLES IN k-GRAPHS
We say that a k-uniform hypergraph C is an `-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of adjacent edges (in the natural ordering of the edges) intersects in precisely ` vertices. We prove that if 1 ≤ ` < k and k − ` does not divide k then any k-uniform hypergraph on n vertices with minimum ...
متن کاملHamiltonian problem on claw-free and almost distance-hereditary graphs
Let G = (V, E) be a connected graph. The distance between two vertices x and y in G, denoted by dG(x, y), is the length of a shortest path between x and y. A graph G is called almost distance-hereditary, if each connected induced subgraph H of G has the property that dH (u, v) ≤ dG(u, v)+ 1 for every pair of vertices u and v in H . We will confirm that every 2-connected, claw-free and almost di...
متن کاملCompatible Hamilton cycles in Dirac graphs
A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once. A celebrated theorem of Dirac from 1952 asserts that every graph on n ≥ 3 vertices with minimum degree at least n/2 is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we obtain the following strengthening of this result. Given a graph G = (V,E), an incompatibility system F over G is a fa...
متن کاملHamilton cycles in random lifts of graphs
An n-lift of a graph K, is a graph with vertex set V (K)× [n] and for each edge (i, j) ∈ E(K) there is a perfect matching between {i} × [n] and {j} × [n]. If these matchings are chosen independently and uniformly at random then we say that we have a random n-lift. We show that there are constants h1, h2 such that if h ≥ h1 then a random n-lift of the complete graph Kh is hamiltonian whp and if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2016
ISSN: 2391-5455
DOI: 10.1515/math-2016-0003